Space Applications for Distributed Constraint Reasoning

نویسندگان

  • Bradley J. Clement
  • Anthony C. Barrett
چکیده

A potential weakness of any research is its applicability to real problems, and it is often difficult to determine whether a particular application needs a particular technology. Space missions offer a wide variety of multiagent problem domains, but the technology needs of these missions vary. Techniques developed by research in Distributed Constraint Reasoning (DCR) employ representations that can be applied to distributed problems generally (in the same way that many problems can be represented as constraint satisfaction problems). We briefly describe how different motivations for operating spacecraft translate into different multiagent problems and research challenges for DCR.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Distributed Constraint Reasoning

Distributed constraint reasoning (DCR) has recently generated much interest due to its ability to solve many real world problems without centralizing all of the information. Many DCR algorithms, however, are prone to failure if even a single agent fails, creating a situation with not only a central point of failure, but with n-points of failure! There are three main contributions of this work. ...

متن کامل

Spatio-temporal Reasoning Using a Multi-dimensional Tesseral Representation

A versatile and universally applicable quantitative multi-dimensional reasoning mechanism founded on a unique linear tesseral representation of space is described. The reasoning mechanism is based on a constraint satisfaction mechanism supported by a heuris-tically guided constraint selection strategy. The mechanism has been incorporated into a spatio-temporal reasoning system, the SPARTA (SPAt...

متن کامل

Spatio - Temporal Reasoning Using Amulti - Dimensional Tesseralrepresentationf

A versatile and universally applicable quantitative multi-dimensional reasoning mechanism founded on a unique linear tesseral representation of space is described. The reasoning mechanism is based on a constraint satisfaction mechanism supported by a heuristically guided constraint satisfaction approach The mechanism has been incorporated into a spatio-temporal reasoning system, the SPARTA (SPA...

متن کامل

Stochastic Game Modelling for Distributed Constraint Reasoning with Privacy

Privacy has been a major concern for agents in distributed constraint reasoning. In this work, we approach this issue in distributed constraint reasoning by letting agents compromise solution quality for preserving privacy, using utility theory. We formalize privacy in the context of distributed constraint reasoning, detail its different aspects, and present model and solvers, as well as their ...

متن کامل

AI-Based Schedulers in Manufacturing Practice: Report of a Panel Discussion

degree in Mathematics from Westminster College, and M.S. and Ph.D. degrees in Computer Science from the University of Pittsburgh. His research interests include constraint-based planning and scheduling, integration of predictive and reactive decision-making, distributed problem solving, temporal reasoning, machine learning, and knowledge-based production management. He has been a principal arch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005